minimization problem造句
例句与造句
- Continuation method for non - linear l1 norm minimization problem
1模极小化问题的路径跟踪算法 - Constrained minimization problem
约束最小化问题 - This paper presents a solution to the test time minimization problem for core - based systems
本文针对基于芯核系统的测试时间最小化问题提出了一种解决方案。 - With merit function , the origin problem can be conformed to unconstrained or constrained minimization problems
利用merit函数的极小化变形可分为无约束和约束两种类型。 - It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我们知道，通过广义d -间隙函数，可以将变分不等式问题转化为一个无约束极小化问题。 - It's difficult to find minimization problem in a sentence. 用minimization problem造句挺难的
- When the systems is normal , the stability condition of the observer system is approximated with a minimization problem involving conditions of linear matrix inequalities
假定其可能发生故障，设计了离散状态观测器，对其进行故障检测。 - Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
最后，还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解。 - Similarly , the minimization problem is also transformed into a multiobjective problem by using the other order relations , so by doing the multiobjective problem a solution of the primitive problem can be obtained
而对最小化问题，也可定义区间数之间的另一序关系，同样可把原问题转化为一个多目标问题，通过求此多目标问题得到原问题的解。 - In this chapter , we consider the method of constrained equivalent formulation . we use the merit function based on the restrained ncp function and convert the origin problem ncp ( f ) to minimization problem which constrained on rn +
我们在这一章里就考虑了ncp ( f )的约束极小化变形，通过限制的ncp函数来构造ncp问题的merit函数，将原始的问题ncp ( f )转化为( - In this paper , we consider identifications of physical parameters in the following parabolic initial - boundary value problems . the identification problem is formulated as a constrained minimization problem by using the output least squares approach with the h1 - regularization
作为一个最优控制问题，我们视温度分布v为输出，参数q ( x )为控制，考虑了一类最优控制问题的逆问题。 - The algorithm only needs to solve an ill - posed linear system and a well - posed minimization problem and requires only the knowledge of the near field measurements of the scattered fields due to point source fields at a finite number of incidence and observation points distributed over a limited aperture
该算法只需求解一个不适定的线性系和一个适定的非线性最小化问题，而且只需要点源入射场的散射场在某个有限孔径中若干有限个入射和测量点上的近场测量信息。 - Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming . at first , we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3
首先针对前两章的对偶算法由于需要精确求解一系列无约束极小化问题，因而实际计算中很难实现这一缺点，构造修正的对偶算法，即，关于势函数的无约束极小化问题无需精确求解的对偶算法。 - By intro - ducing a penalty function as the following , for every e > 0 , we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem . the solutions of such a sequence of unconstrained minimization problems all exist , and they converge to the solution of the constrained minimization problem in a certain sense
这列无约束极小化问题( p _ )的解都是存在的，并且在某种意义下收敛至原始约束极小化问题( p )的解，不仅如此，它们的性能指标也收敛至原始问题( p )解的性能指标。